User-Defined Types in a Polymorphic Language

Literals for user-defined types

This note proposes a notion of user-defined literals based on literal constructors without requiring new syntax. If combined with the separate proposal for generalized initializer lists, it becomes a generalization of the C99 notion of compound literals. Basically, a constructor defines a user-defined literal if it is inline and specifies a simple mapping of its arguments to object representati...

Expressing Polymorphic Types in a Many-Sorted Language

In this paper, we study translation from a first-order logic with polymorphic types à la ML (of which we give a formal description) to a many-sorted or one-sorted logic as accepted by mainstream automated theorem provers. We consider a three-stage scheme where the last stage eliminates polymorphic types while adding the necessary “annotations” to preserve soundness, and the first two stages ser...

Extending POLIS with User-Defined Data Types

High Level Indexing of User-Defined Types

Miranda: A Non-Strict Functional language with Polymorphic Types

data types Many of the data types which in other languages would have to be expressed as abstract data types can be represented in Miranda as algebraic data types with associated laws. Nevertheless there is still a need for abstract data types, as may be seen from the following example (which is based on a use of abstract data types in the LCF system [Gordon et al 79]).